Description: 主要解决旅行商问题(traveling saleman problem,简称tsp，即已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市，求解最短距离的遗传算法。-mainly to solve the traveling salesman problem (traveling saleman problem, listed tsp, known cities n between the distance from the existing one salesman must traveled n this city, and visit each city only once, finally starting to return to the city, for the shortest distance from the genetic algorithm. Platform: |
Size: 1575 |
Author:阳文 |
Hits:
Description: 英文资料。利用蚁群算法正反馈、并行计算的优点，将蚁群算法用于求解典型的NP-hard问题—旅行商问题。-English. Ant algorithm is the use of feedback, the advantages of parallel computing, Ant algorithm will be used to solve the typical NP-hard problem-Traveling Salesman Problem. Platform: |
Size: 300106 |
Author:safin |
Hits:
Description: 用于求解TSP(Traveling salesman problem，旅行商问题)问题，基本执行见run.bat, 其它详见其中的readme.txt。（实例为TSPLIB格式，见myprojects目录，包括eil51, d198, lin318等小型问题，以及1000到3000城市之间的例子，基本能得到最优解）-for TSP (Traveling salesman problem, TSP), the implementation of basic run.bat see, see the other readme.txt. (Example format for the ACS, see myprojects catalogs, including eil51, d198. lin318 other small-scale, and from 1000 to 3000 among cities example, can be the optimal solution) Platform: |
Size: 234573 |
Author:caqi |
Hits:
Description: 图论中的经典TSP旅行商问题的“便宜”算法，C语言实现的DOC程序。-graph theory of classical TSP Traveling Salesman Problem "bargain" algorithm, C language DOC procedures. Platform: |
Size: 6229 |
Author:周龙亭 |
Hits:
Description: 这是一个用matlab编写的，关于如何用遗传算法来解决货郎担问题的程序-using Matlab, prepared on how to use genetic algorithms to solve the traveling salesman problem procedures Platform: |
Size: 7352 |
Author:袁成序 |
Hits:
Description: 是全面分析旅行商问题的工具箱，包含了很多方面的测试程序-is a comprehensive analysis of the traveling salesman problem toolbox contains a lot of testing procedures Platform: |
Size: 551171 |
Author: 包海洁 |
Hits:
Description: 利用遗传算法解决旅行商问题，以五个城市为例，给出了程序的源码和具体说明。-using genetic algorithms to solve the traveling salesman problem, and to five cities as an example, the program source and specify. Platform: |
Size: 9784 |
Author:王萱 |
Hits:
Description: 这是从其他网站下载的C#程序，用以求解旅行商的问题，采用算法为遗传算法-This is downloaded from other websites C# procedure for solving the traveling salesman problem, the algorithm used for the genetic algorithm Platform: |
Size: 3457 |
Author:刘艳 |
Hits:
Description: 旅行商问题：
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. Platform: |
Size: 56695 |
Author:章为到 |
Hits:
Description: 旅行商问题（动态规化）
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。
例如：给定4个城市{1，2，3，4}及其各城市之间的路程
-traveling salesman problem (dynamic regulation of) a salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. For example : given four cities (1,2,3,4) and the distance between cities Platform: |
Size: 60163 |
Author:586 |
Hits:
Description: 旅行商问题
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。
例如：给定4个城市{1，2，3，4}及其各城市之间的路程
最优路线是1,3,2,4,1，
其最短路程是25-a salesman, traveling salesman problem, a number of cities to sell commodities, the known distance between the city (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. For example : given four cities (1,2,3,4) and the distance between the city optimal route is 1,3,2,4, 1, the shortest distance is 25 Platform: |
Size: 40399 |
Author:吴博 |
Hits:
Description: 使用蚁群算法解决旅行商问题，mfc应用程序，城市数目及坐标在eil51.tsp里-use ant algorithm to solve the traveling salesman problem, and mfc applications, The number of cities and coordinates the eil51.tsp Lane Platform: |
Size: 45129 |
Author:pj |
Hits:
Description: Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
Platform: |
Size: 3210 |
Author:阳关 |
Hits:
Search - traveling salesman problem